Adapting a Rapidly-Exploring Random Tree for Automated Planning
نویسندگان
چکیده
Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning problems. They are one of the most successful state-of-the-art techniques as they offer a great degree of flexibility and reliability. However, their use in other search domains has not been thoroughly analyzed. In this work we propose the use of RRTs as a search algorithm for automated planning. We analyze the advantages that this approach has over previously used search algorithms and the challenges of adapting RRTs for implicit and discrete search spaces.
منابع مشابه
RSRT: Rapidly exploring sorted random tree - online adapting rrt to reduce computational solving time while motion planning in wide configuration spaces
We present a new algorithm, named RSRT, for Rapidly-exploring Random Trees (RRT) based on inherent relations analysis between RRT components. RRT algorithms are designed to consider interactions between these inherent components. We explain properties of known variations and we present some future once which are required to deal with dynamic strategies. We present experimental results for a wid...
متن کاملDecoupled Sampling Based Planning Method for Multiple Autonomous Vehicles
This paper proposes a sampling based planning algorithm to control autonomous vehicles. We propose an improved Rapidly-exploring Random Tree which includes the definition of Knearest points and propose a two-stage sampling strategy to adjust RRT in other to perform maneuver while avoiding collision. The simulation results show the success of the algorithm.
متن کاملEmbedding Heuristic Rules in RRT Path Planning of Excavators
Improving safety and productivity of earthwork operations is of paramount importance, especially in congested sites where collisions are more probable. Automated Machine Guidance and Control technology is expected to improve both safety and productivity of earthwork operations by providing excavator operators with higher level of support regarding the path planning of excavators based on site c...
متن کاملProbabilistic Rapidly-exploring Random Trees for autonomous navigation among moving obstacles
The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. The planning algorithm is based on an extension of the Rapidly-exploring Random Tree algorithm, where the likelihood of the obstacles trajectory and the probability of collision is explicitly taken into account. The algorithm...
متن کاملUsing random sampling trees for automated planning
Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning problems. They are one of the most successful state-of-the-art techniques in motion planning, as they offer a great degree of flexibility and reliability. However, their use in other fields in which search is a commonly used approach has not been thoroughly analyzed. I...
متن کامل